
// 646.最长数对链
class Solution {
public:
    int findLongestChain(vector<vector<int>>& pairs) {
        // 动态规划进行解决

        int n = pairs.size() , ret = 1;
        sort(pairs.begin() , pairs.end());
        vector<int> dp(n,1);
        for(int i = 1; i < n ;i++)
        {
            for(int j = 0 ; j < i ; j++)
            {
                if(pairs[j][1] < pairs[i][0])
                    dp[i] = max(dp[i] , dp[j] + 1);
            }
            ret = max(ret, dp[i]);
        }
        return ret;
    }
};